Thanks for picking this up — the implementation matches the spec cleanly. Wagner-Fischer DP, the half-length cap for very short inputs, the alphabetical tiebreak for deterministic output, and all five test cases (typo / missing / extra / transposition / no-match) are covered. Nice work for a first PR.

One blocker on CI: typecheck fails because the repo runs noUncheckedIndexedAccess: true, so the indexed reads in the inner DP loop come back as number | undefined. Three ! assertions on line 33 will clear it:

next[j + 1] = Math.min(next[j]! + 1, prev[j + 1]! + 1, prev[j]! + cost);

The trailing prev[b.length] ?? 0 is already fine — that one doesn't need a change.

Push that and I'll merge.

any progress? want this feature

Merged — thanks @zerone0x! Took the liberty of rebasing onto current main, fixing the 3 noUncheckedIndexedAccess type errors in the levenshtein loop, and resolving the dispatch.ts import conflict; pushed the result to your branch and squash-merged. Levenshtein helper is clean, test coverage is solid. Apologies for the slow review — appreciate your patience.